Improved Error Bounds for Underdetermined System Solvers
نویسندگان
چکیده
منابع مشابه
Improved error bounds for underdetermined system solvers
The minimal 2-norm solution to an underdetermined system Ax b of full rank can be computed using a QR factorization of AT in two different ways. One method requires storage and reuse of the orthogonal matrix Q, while the method of seminormal equations does not. Existing error analyses show that both methods produce computed solutions whose normwise relative error is bounded to first order by ca...
متن کاملImproved Uniform Test Error Bounds
We derive distribution free uniform test error bounds that improve on VC type bounds for validation We show how to use knowledge of test inputs to improve the bounds The bounds are sharp but they require intense computation We introduce a method to trade sharpness for speed of computation Also we compute the bounds for several test cases Key wordsmachine learning learning theory generalization ...
متن کاملA Posteriori Error Estimates including Algebraic Error: Computable Upper Bounds and Stopping Criteria for Iterative Solvers
We consider the finite volume and the lowest-order mixed finite element discretizations of a second-order elliptic pure diffusion model problem. The first goal of this paper is to derive guaranteed and fully computable a posteriori error estimates which take into account an inexact solution of the associated linear algebraic system. We show that the algebraic error can be simply bounded using t...
متن کاملImproved Error Bounds for Inner Products in Floating-Point Arithmetic
Given two floating-point vectors x, y of dimension n and assuming rounding to nearest, we show that if no underflow or overflow occurs, any evaluation order for inner product returns a floating-point number r̂ such that |r̂ − xT y| 6 nu|x|T |y| with u the unit roundoff. This result, which holds for any radix and with no restriction on n, can be seen as a generalization of a similar bound given in...
متن کاملImproved Error Bounds for Tree Representations of Metric Spaces
Estimating optimal phylogenetic trees or hierarchical clustering trees from metric data is an important problem in evolutionary biology and data analysis. Intuitively, the goodness-of-fit of a metric space to a tree depends on its inherent treeness, as well as other metric properties such as intrinsic dimension. Existing algorithms for embedding metric spaces into tree metrics provide distortio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Matrix Analysis and Applications
سال: 1993
ISSN: 0895-4798,1095-7162
DOI: 10.1137/0614001